Refined large deviations for von Mises statistics
نویسندگان
چکیده
منابع مشابه
Cramér-Von Mises Statistics for Discrete Distributions
The Cramér-von Mises family of goodness-of-fit statistics is a well-known group of statistics used to test fit to a continuous distribution. In this article we extend the family to provide tests for discrete distributions. The statistics examined are the analogues of those associated with the names of Cramér-von Mises, Watson and Anderson-Darling, called W , U and A respectively, and their comp...
متن کاملVon Mises Type Statistics for Single Site Updated Local Interaction Random Elds Running Title: Von Mises Statistics for Random Elds
Random eld models in image analysis and spatial statistics usually have local interactions. They can be simulated by Markov chains which update a single site at a time. The updating rules typically condition on only a few neighboring sites. If we want to approximate the expectation of a bounded function, can we make better use of the simulations than through the empirical estimator? We describe...
متن کاملApproximations for Von Mises
We prove Edgeworth expansions for degenerate von Mises statistics like the Beran, Watson, and Cram er-von Mises goodness-of-t statistics. Furthermore, we show that the bootstrap approximation works up to an error of order O(N ?1=2) and that Bootstrap based conndence regions attain a prescribed conndence level up to the order O(n ?1).
متن کاملSample Path Large Deviations for Order Statistics
We consider the sample paths of the order statistics of independent and identically distributed random variables with common distribution function F . If F is strictly increasing but possibly having discontinuities, we prove that the sample paths of the order statistics satisfy the large deviation principle in the Skorokhod M1 topology. Sanov’s theorem is deduced in the SkorokhodM ′ 1 topology ...
متن کاملRefined large deviations asymptotics for Markov-modulated infinite-server systems
Many networking-related settings can be modeled by Markov-modulated infinite-server systems. In such models, the customers’ arrival rates and service rates are modulated by a Markovian background process; additionally, there are infinitely many servers (and consequently the resulting model is often used as a proxy for the corresponding many-server model). The Markov-modulated infinite-server mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Теория вероятностей и ее применения
سال: 2004
ISSN: 0040-361X
DOI: 10.4213/tvp247